Inverse problems for unilevel block α-circulants
نویسنده
چکیده
We consider the following inverse problems for the class Cα of unilevel block α-circulants C = [Cs−αr ] k−1 r,s=0, where k > 1, C0, C1, . . . , Ck−1 ∈ Cd1×d2 , α ∈ {1, 2, . . . , k − 1}, gcd(α, k) = 1, and ‖ · ‖ is the Frobenius norm. Problem 1 Find necessary and sufficient conditions on Z ∈ Ckd2×h and W ∈ C1 for the existence of C ∈ Cα such that CZ = W , and find all such C if the conditions are satisfied. Problem 2 For arbitrary Z ∈ C2 and W ∈ C1, find σα(Z,W ) = min C∈Cα ‖CZ −W‖, characterize the class Mα(Z,W ) = { C ∈ Cα ∣∣ ‖CZ −W‖ = σα(Z,W ) } , and find C in this class with minimum norm. Problem 3 If A ∈ Cα is given, find σα(Z,W,A) = min C∈Mα(Z,W ) ‖C −A‖ and find C ∈ Mα(Z,W ) such that ‖C −A‖ = σα(Z,W,A). We also consider slightly modified problems for the case where gcd(α, k) > 1. MSC: 15A09; 15A15; 15A18; 15A99
منابع مشابه
Spectral features and asymptotic properties for α-circulants and α-Toeplitz sequences: theoretical results and examples
For a given nonnegative integer α, a matrix An of size n is called α-Toeplitz if its entries obey the rule An = [ar−αs] n−1 r,s=0. Analogously, a matrix An again of size n is called α-circulant if An = [ a(r−αs) modn ]n−1 r,s=0 . Such kind of matrices arises in wavelet analysis, subdivision algorithms and more generally when dealing with multigrid/multilevel methods for structured matrices and ...
متن کاملOn CIS circulants
A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size α = α(G), or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. It is not difficult to show that a circulant G is a CIS graph if and only if G and its complement G are both well-co...
متن کاملRrr 7 - 2013 Time Consistency versus Law Invariance in Multistage Stochastic Optimization with Coherent Risk Measures : Multilevel Optimization Modeling and Computational
A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size α = α(G), or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. It is not difficult to show that a circulant G is a CIS graph if and only if G and its complement G are both well-co...
متن کاملEigenvector and Eigenvalues of Some Special Graphs. IV. Multilevel Circulants
A multilevel circulant is defined as a graph whose adjacency matrix has a certain block decomposition into circulant matrices. A general algebraic method for finding the eigenvectors and the eigenvalues of multilevel circulants is given. Several classes of graphs, including regular polyhedra, suns, and cylinders can be analyzed using this scheme.
متن کاملThe hybrid block iterative algorithm for solving the system of equilibrium problems and variational inequality problems
ABSTRACT In this paper, we construct the hybrid block iterative algorithm for finding a common element of the set of common fixed points of an infinite family of closed and uniformly quasi - ϕ- asymptotically nonexpansive mappings, the set of the solutions of the variational inequality for an α-inverse-strongly monotone operator, and the set of solutions of a system of equilibrium problems. Mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013